Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers

Compositions of Extended Top-down Tree Transducers

Unfortunately, the class of transformations computed by linear extended top-down tree transducers with regular look-ahead is not closed under composition. It is shown that the class of transformations computed by certain linear bimorphisms coincides with the previously mentioned class. Moreover, it is demonstrated that every linear epsilon-free extended top-down tree transducer with regular loo...

The Power of Weighted Regularity-Preserving Multi Bottom-Up Tree Transducers

The expressive power of regularity-preserving ε-free weighted linear multi bottom-up tree transducers is investigated. These models have very attractive theoretical and algorithmic properties, but their expressive power is not well understood especially in the weighted setting. It is proved that despite the restriction to preserve regularity their power still exceeds that of composition chains ...

Extended Multi Bottom-Up Tree Transducers Composition and Decomposition

Extended multi bottom-up tree transducers are de ned and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of rules; this includes rules that do not consume input. It is shown that such transducers, even linear ones, can compute all transformations that are computed by linear extended top-down tree transducers, which are a th...

Composition of Linear and Nondeleting Top-Down Tree Transducers with ε-Rules

Composition and Decomposition of Extended Multi Bottom-Up Tree Transducers?

Extended multi bottom-up tree transducers are de ned and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of rules; this includes rules that do not consume input. It is shown that such transducers can compute all transformations that are computed by linear extended top-down tree transducers (which are a theoretical model for...